Quadratic forms and the graph isomorphism problem
نویسندگان
چکیده
منابع مشابه
The Graph Isomorphism Problem
The graph isomorphism problem can be easily stated: check to see if two graphs that look di erently are actually the same. The problem occupies a rare position in the world of complexity theory, it is clearly in NP but is not known to be in P and it is not known to be NP-complete. Many sub-disciplines of mathematics, such as topology theory and group theory, can be brought to bear on the proble...
متن کاملOn the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity of the graphs isomorphism and subgraph isomorphim problems. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملThe Graph Isomorphism Problem and approximate categories
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many pairs of graphs, but the pairs of non-isomorphic graphs constructed by Cai, Fürer and Immerman it cannot distinguish. If d is fixed, then the WL-algorithm run...
متن کاملPermutation groups and the graph isomorphism problem
In this article, we discuss various algorithms for permutation group theoretic problems and study its close connection to the graph isomorphism problem. Motivated by this close connection, the last part of this article explores the group representability problem and mention some open problems that arise in this context.
متن کاملSolving the "Isomorphism of Polynomials with Two Secrets" Problem for all Pairs of Quadratic Forms
We study the Isomorphism of Polynomial (IP2S) problem with m = 2 homogeneous quadratic polynomials of n variables over a finite field of odd characteristic: given two quadratic polynomials (a,b) on n variables, we find two bijective linear maps (s, t) such that b = t◦a◦s. We give an algorithm computing s and t in time complexity Õ(n) for all instances. The IP2S problem was introduced in cryptog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1991
ISSN: 0024-3795
DOI: 10.1016/0024-3795(91)90183-w